Improving Multicast Tree Construction in Static Ad Hoc Networks
نویسندگان
چکیده
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-basedmulticast trees and analyse its performance. Additionally, the potential of further improvements in the tree construction is addressed comparing the performance of the algorithm with the results from a simulated annealing optimisation.
منابع مشابه
Adaptive backbone-based multicast for ad hoc networks
This paper describes an adaptive multicast mechanism for ad hoc networks. The multicast mechanism adopts a two-tier architecture with an adaptive backbone infrastructure to integrate the effectiveness of the flooding scheme and the efficiency of the tree-based scheme for different network conditions. Coverage of a backbone node is not limited to a single hop, but is automatically adjusted accor...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملEnergy Efficient Broadcasting and Multicasting in Static Wireless Ad Hoc Networks
In this paper, we present three energy efficient broadcast and multicast routing algorithms for wireless ad hoc networks. The first algorithm computes a broadcast tree whose energy consumption is within a factor 2 + 2 ln(n − 1) of the optimal. The second algorithm computes a multicast tree whose energy consumption is within a constant factor of the optimal. Our third algorithm, for a multicast ...
متن کاملThe investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks
In this paper, we focus on the problem concerning how to construct a delay-constrained multicast tree with minimum-energy consumption in ad-hoc wireless networks. Based on link-replacing strategies, an algorithm called Energy-based Link Replacement (ELR) is presented. The ELR algorithm begins with a two-level multicast tree and then iteratively replaces the high-power links with a few of lower-...
متن کامل